played on partial isomorphisms

نویسندگان

  • Jouko Väänänen
  • Boban Veličković
  • J. Väänänen
  • B. Veličković
چکیده

We study the poset 〈Iκ ,⊆〉 as a measure of how similar the structures A and B are to each other. A subset X of Iκ has the κ back-and-forth property if for all λ < κ ∀p ∈ X[∀a ∈ λA∃b ∈ B (p ∪ {〈a(i), b(i)〉 : i < λ} ∈ X) ∧ ∀b ∈ λB∃a ∈ A(p ∪ {〈a(i), b(i)〉 : i < λ} ∈ X)]. It is obvious that there is a largest κ-back-and-forth set which we denote by I∗ κ . The structures A and B are said to be partially isomorphic, A p B, if I∗ 2 = ∅. We get stronger criteria by demanding that I∗ κ is not just non-empty but “large”. This leads naturally to the condition: (σ )κ There is a set D ⊆ I∗ κ which has the κ-back-and-forth property and is σ -closed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetrized Induced Ramsey Theory

We prove induced Ramsey theorems in which the monochromatic induced subgraph satisfies that all members of a prescribed set of its partial isomorphisms extend to automorphisms of the colored graph (without requirement of preservation of colors). We consider vertex and edge colorings, and extensions of partial isomorphisms in the set of all partial isomorphisms between singletons as considered b...

متن کامل

Combinatorial problems from transformation semigroups

algebra and enumerative combinatorics We learn something when we can interpret combinatorial numbers as orders of algebraic structures, especially groups. Lagrange’s Theorem means that group orders tend to have a rich arithmetic structure. I first learned from Norman’s paper on chip-firing games the fact that the number of spanning trees of a graph is the order of an abelian group canonically a...

متن کامل

Une étude des sommes fortes : isomorphismes et formes normales. (A study of strong sums: isomorphisms and normal forms)

A study of strong sums: isomorphisms and normal forms The goal of this thesis is to study the sum and the zero within two principal frameworks: type isomorphisms and the normalization of λ-terms. Type isomorphisms have already been studied within the framework of the simply typed λ-calculus with surjective pairing but without sums. To handle the case with sums and zero, I first restricted the s...

متن کامل

The Category CNOT

We exhibit a complete set of identities for CNOT, the symmetric monoidal category generated by the controlled-not gate, the swap gate, and the computational ancillæ. We prove that CNOT is a discrete inverse category. Moreover, we prove that CNOT is equivalent to the category of partial isomorphisms of finitely-generated non-empty commutative torsors of characteristic 2. Equivalently this is the...

متن کامل

Isomorphisms between Predicate and State Transformers

We study the relation between state transformers based on directed complete partial orders and predicate transformers. Concepts likèpredicate', `liveness', `safety' and`predicate transformers' are formulated in a topological setting. We treat state transformers based on the Hoare, Smyth and Plotkin powerdomains and consider continuous, monotonic and unrestricted functions. We relate the transfo...

متن کامل

An Isomorphism Extension Theorem For Landau-Ginzburg B-Models

Landau-Ginzburg mirror symmetry studies isomorphisms between Aand B-models, which are graded Frobenius algebras that are constructed using a weighted homogeneous polynomial W and a related symmetry group G. Given two polynomials W1, W2 with the same weights and same group G, the corresponding A-models built with (W1,G) and (W2,G) are isomorphic. Though the same result cannot hold in full genera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003